Approximately Counting Triangles in Sublinear Time
نویسندگان
چکیده
منابع مشابه
Counting Triangles in Sub-linear Time
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in two models: exact counting algorithms, which require reading the entire graph, and streaming algorithms, where the edges are given in a stream and the memory is limited. In this work we design a sublinear-time algorithm for approximating the number of triangles in a graph, wher...
متن کاملApproximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage
Counting triangles in a large graph is important for detecting network anomalies such as spam web pages and suspicious accounts (e.g., fraudsters and advertisers) on online social networks. However, it is challenging to compute the number of triangles in a large graph represented as a stream of edges with a low computational cost when given a limited memory. Recently, several effective sampling...
متن کاملApproximately counting cliques
We present a very simple, randomized approximation algorithm for determining the number of cliques in a random graph. Supported in part by NSF Grant CCR-9505448 and a UC Berkeley Faculty Research Grant
متن کاملCounting Triangulations Approximately
We consider the problem of counting straight-edge triangulations of a given set P of n points in the plane. Until very recently it was not known whether the exact number of triangulations of P can be computed asymptotically faster than by enumerating all triangulations. We now know that the number of triangulations of P can be computed in O∗(2n) time [2], which is less than the lower bound of Ω...
متن کاملCounting All Equilateral Triangles In
We describe a procedure of counting all equilateral triangles in the three dimensional space whose coordinates are allowed only in the set {0, 1, ..., n}. This sequence is denoted here by ET (n) and it has the entry A102698 in “The On-Line Encyclopedia of Integer Sequences”. The procedure is implemented in Maple and its main idea is based on the results in [3]. Using this we calculated the valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2017
ISSN: 0097-5397,1095-7111
DOI: 10.1137/15m1054389